Genetic Algorithm SAmple Consensus (GASAC)

نویسندگان

  • Volker Rodehorst
  • Olaf Hellwich
چکیده

A new robust estimator based on an evolutionary optimization technique is proposed. The general hypothesizeand-verify strategy accelerates the parameter estimation substantially by systematic trial and parallel evaluation without the use of prior information. The method is evaluated by estimation of multi-view relations, i.e. the fundamental matrix. Additionally, some results for the trifocal geometry are presented. However, the general methodology could be used for any problem in which relations can be determined from a minimum number of points.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Novel Adaptive Genetic Algorithm Sample Consensus

Random sample consensus (RANSAC) is a successful algorithm in model fitting applications. It is vital to have strong exploration phase when there are an enormous amount of outliers within the dataset. Achieving a proper model is guaranteed by pure exploration strategy of RANSAC. However, finding the optimum result requires exploitation. GASAC is an evolutionary paradigm to add exploitation capa...

متن کامل

Novel consensus quantitative structure-retention relationship method in prediction of pesticides retention time in nano-LC

In this study, quantitative structure-retention relationship (QSRR) methodology employed for modeling of the retention times of 16 banned pesticides in nano-liquid chromatography (nano-LC) column. Genetic algorithm-multiple linear regression (GA-MLR) method employed for developing global and consensus QSRR models. The best global GA-MLR model was established by adjusting GA parameters. Three de...

متن کامل

An Efficient Target Tracking Algorithm Based on Particle Filter and Genetic Algorithm

In this paper, we propose an efficient hybrid Particle Filter (PF) algorithm for video tracking by employing a genetic algorithm to solve the sample impoverishment problem. In the presented method, the object to be tracked is selected by a rectangular window inside which a few numbers of particles are scattered. The particles’ weights are calculated based on the similarity between feature vecto...

متن کامل

An Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ

An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...

متن کامل

An Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ

An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006